Query processing techniques for arrays
نویسندگان
چکیده
منابع مشابه
Query Processing Techniques for Multimedia Presentation Graphs
Taekyong Lee and G ultekin Ozsoyo glu Department of Computer Engineering and Science Case Western Reserve University Cleveland, OH 44106 ftlee, [email protected] Abstract: Multimedia presentations are stored into and queried from multimedia databases. In an earlier work, we have designed a graphical query language, called GVISUAL, that allows users to query multimedia presentations based o...
متن کاملSketch Techniques for Approximate Query Processing
Sketch techniques have undergone extensive development within the past few years. They are especially appropriate for the data streaming scenario, in which large quantities of data flow by and the the sketch summary must continually be updated quickly and compactly. Sketches, as presented here, are designed so that the update caused by each new piece of data is largely independent of the curren...
متن کاملEfficient Query Processing Techniques for Spatial Time
A spatial time series dataset is a collection of time series, each referencing a location in a common spatial framework. Correlation analysis is often used to identify pairs of potentially interacting elements from the cross product of two spatial time series datasets (the two datasets may be the same). However, the computational cost of correlation analysis is very high when the dimension of t...
متن کاملQuery Processing Techniques for Multiversion Access Methods
Multiversion access methods have been emerged in the literature primarily to support queries on a transaction-time database where records are never physically deleted. For a popular class of efficient methods (including the multiversion Btree), data records and index entries are occasionally duplicated to separate data according to time. In this paper, we present techniques for improving query ...
متن کاملDistributed Query Processing Using Suffix Arrays
Suffix arrays are more efficient than inverted files for solving complex queries in a number of applications related to text databases. Examples arise when dealing with biological or musical data or with texts written in oriental languages, and when searching for phrases, approximate patterns and, in general, regular expressions involving separators. In this paper we propose algorithms for proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 1999
ISSN: 0163-5808
DOI: 10.1145/304181.304211